//思路由于我们不能是有序的那我们每次中间取数往两边扩展
//正确思路就是为了保证两边都比我小，就是先放最小小的再放最大的再放最小的
#include<bits/stdc++.h>
using namespace std;

int n;
int main()
{
    cin >> n;
    if (n % 2 == 0)
    {
        int left = n / 2;
        int right = left + 1;
        while (left >= 1 && right <= n)
        {
            cout << left << " " << right<<" ";
            right++;
            left--;
        }
    }
    else
    {
        int left = n / 2 + 1;
        int right = left;
        while (left >= 1 && right <= n)
        {
            if (left == right)
            {
                cout << left << " ";
                right++;
                left--;
                continue;
            }
            cout << left << " " << right<<" ";
            right++;
            left--;
        }
    }
    return 0;
}
